Dual Lattice

In the theory of lattices, the dual lattice is a construction analogous to that of a dual vector space. In certain respects, the geometry of the dual lattice of a lattice $L$ is the reciprocal of the geometry of $L$, a perspective which underlies many of its uses.

Dual lattices have many applications inside of lattice theory, theoretical computer science, cryptography and mathematics more broadly. For instance, it is used in the statement of the Poisson summation formula, transference theorems provide connections between the geometry of a lattice and that of its dual, and many lattice algorithms exploit the dual lattice.

For an article with emphasis on the physics / chemistry applications, see Reciprocal lattice. This article focuses on the mathematical notion of a dual lattice.

Definition

Let $L \subseteq \mathbb^n$ be a lattice. That is, $L = B \mathbb^n$ for some matrix $B$.

The dual lattice is the set of linear functionals on $L$ which take integer values on each point of $L$:

:$L^* = \.$

If $(\mathbb^n)^*$ is identified with $\mathbb^n$ using the dot-product, we can write $L^* = \.$ It is important to restrict to vectors in the span of $L$, otherwise the resulting object is not a lattice.

Despite this identification of ambient Euclidean spaces, it should be emphasized that a lattice and its dual are fundamentally different kinds of objects; one consists of vectors in Euclidean space, and the other consists of a set of linear functionals on that space. Along these lines, one can also give a more abstract definition as follows:

:$L^* = \ = \text_(L, \mathbb).$

However, we note that the dual is not considered just as an abstract Abelian group of functionals, but comes with a natural inner product: $f \cdot g = \sum_i f(e_i) g(e_i)$, where $e_i$ is an orthonormal basis of $\text(L)$. (Equivalently, one can declare that, for an orthonormal basis $e_i$ of $\text(L)$, the dual vectors $e^*_i$, defined by $e_i^*(e_j) = \delta_$ are an orthonormal basis.) One of the key uses of duality in lattice theory is the relationship of the geometry of the primal lattice with the geometry of its dual, for which we need this inner product. In the concrete description given above, the inner product on the dual is generally implicit.

Properties

We list some elementary properties of the dual lattice:
* If B = _1, \ldots, b_n is a matrix giving a basis for the lattice $L$, then $z \in \text(L)$ satisfies $z \in L^* \iff b^T_i z \in \mathbb, i = 1, \ldots, n \iff B^T z \in \mathbb^n$.
* If $B$ is a matrix giving a basis for the lattice $L$, then $B (B^T B)^$ gives a basis for the dual lattice. If $L$ is full rank $B^$ gives a basis for the dual lattice: $z \in L^* \iff B^T z \in \mathbb^n \iff z \in B^ \mathbb^n$.
* The previous fact shows that $(L^*)^* = L$. This equality holds under the usual identifications of a vector space with its double dual, or in the setting where the inner product has identified $\mathbb^n$ with its dual.
* Fix two lattices $L,M$. Then $L \subseteq M$ if and only if $L^* \supseteq M^*$.
* The determinant of a lattice is the reciprocal of the determinant of its dual: $\text(L^*) = \frac$
* If $q$ is a nonzero scalar, then $(qL)^* = \frac L^*$.
* If $R$ is a rotation matrix, then $(RL)^* = R L^*$.
* A lattice $L$ is said to be integral if $x \cdot y \in \mathbb$ for all $x,y \in L$. Assume that the lattice $L$is full rank. Under the identification of Euclidean space with its dual, we have that $L \subseteq L^*$ for integral lattices $L$. Recall that, if $L' \subseteq L$ and $, L/L', <\infty$, then $\text(L') = \text(L) , L/L',$. From this it follows that for an integral lattice, $\text(L)^2 = , L^* / L,$.
* An integral lattice is said to be ''unimodular'' if $L = L^*$, which, by the above, is equivalent to $\text(L) = 1.$

Examples

Using the properties listed above, the dual of a lattice can be efficiently calculated, by hand or computer. Certain lattices with importance in mathematics and computer science are dual to each other, and we list some here.

Elementary examples

* The dual of $\mathbb^n$ is $\mathbb^n$.
* The dual of $2\mathbb \oplus \mathbb$ is $\frac \mathbb \oplus \mathbb$.
* Let $L = \$ be the lattice of integer vectors whose coordinates have an even sum. Then $L^* = \mathbb^n + (\frac, \ldots, \frac)$, that is, the dual is the lattice generated by the integer vectors along with the all $1/2$s vector.

q-ary lattices

An important class of examples, particularly in lattice cryptography, are given by the q-ary lattices. For a matrix $A \in \mathbb_q^,$ we define $\Delta_q(A) = \, \Delta_q^(A) = \$; these are called, respectively, the image and kernel q-ary lattices associated to $A$. Then, after identifying Euclidean space with its dual, we have that the image and kernel q-ary lattices of a matrix $A$ are dual, up to a scalar. In particular, $\Delta_q(A)^* = \frac \Delta_q^(A)$ and $\Delta_q^(A)^* = \frac \Delta_q(A)$. (The proof can be done as an exercise.)

Transference theorems

Each $f \in L^* \setminus \$ partitions $L$ according to the level sets corresponding to each of the integer values. Smaller choices of $f$ produce level sets with more distance between them; in particular, the distance between the layers is $1 / , , f, ,$. Reasoning this way, one can show that finding small vectors in $L^*$ provides a lower bound on the largest size of non-overlapping spheres that can be placed around points of $L$. In general, theorems relating the properties of a lattice with properties of its dual are known as transference theorems. In this section we explain some of them, along with some consequences for complexity theory.

We recall some terminology: For a lattice $L$ , let $\lambda_i(L)$ denote the smallest radius ball that contains a set of $i$ linearly independent vectors of $L$. For instance, $\lambda_1(L)$ is the length of the shortest vector of $L$. Let $\mu(L) = \text_ d(x, L)$ denote the covering radius of $L$.

In this notation, the lower bound mentioned in the introduction to this section states that $\mu(L) \geq \frac$.

There always an efficiently checkable certificate for the claim that a lattice has a short nonzero vector, namely the vector itself. An important corollary of Banaszcyk's transference theorem is that $\lambda_1(L) \geq \frac$, which implies that to prove that a lattice has no short vectors, one can show a basis for the dual lattice consisting of short vectors. Using these ideas one can show that approximating the shortest vector of a lattice to within a factor of n (the $\text_n$ problem) is in $\text \cap \text$.

Other transference theorems:
* The relationship $\lambda_1(L) \lambda_1(L^*) \leq n$ follows from Minkowski's bound on the shortest vector; that is, $\lambda_1(L) \leq \sqrt (\text(L)^)$, and $\lambda_1(L^*) \leq \sqrt (\text(L^*)^)$, from which the claim follows since $\text(L) = \frac$.

Poisson summation formula

The dual lattice is used in the statement of a general Poisson summation formula.

Further reading

*

References

{{reflist

Lattice theory